An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem
نویسندگان
چکیده
منابع مشابه
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Over the last decade many metaheuristics have been applied to the flowshop scheduling problem, ranging from Simulated Annealing or Tabu Search to complex hybrid techniques. Some of these methods provide excellent effectiveness and efficiency at the expense of being utterly complicated. In fact, several published methods require substantial implementation efforts, exploit problem specific speed-...
متن کاملAn iterated greedy algorithm for the flowshop scheduling problem with blocking
This paper proposes an iterated greedy algorithm for solving the blocking flowshop scheduling problem for makespan minimization. Moreover, it presents an improved NEH-based heuristic, which is used as the initial solution procedure for the iterated greedy algorithm. The effectiveness of both procedures was tested on some of Taillard’s benchmark instances that are considered to be blocking flows...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملImproved genetic algorithm for the permutation flowshop scheduling problem
Genetic algorithms (GAs) are search heuristics used to solve global optimization problems in complex search spaces. We wish to show that the e6ciency of GAs in solving a &owshop problem can be improved signi7cantly by tailoring the various GA operators to suit the structure of the problem. The &owshop problem is one of scheduling jobs in an assembly line with the objective of minimizing the com...
متن کاملAn Iterated Greedy Algorithm for the Flowshop Problem with Sequence Dependent Setup Times
The flowshop problem (FSP) is one of the most thoroughly studied scheduling problems. In the FSP, a set N = {1, . . . , n} of n independent jobs has to be processed on a set M = {1, . . . ,m} of m machines. Every job j, j ∈ N , requires a given fixed, non-negative processing time pij on every machine i, i ∈ M . In a flowshop, all n jobs are to be processed on the m machines in the same order, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Omega
سال: 2014
ISSN: 0305-0483
DOI: 10.1016/j.omega.2013.10.002